/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution
{
public:
    vector<int> ret;
    void Print(ListNode* head)
    {
        if (head == nullptr)return;
        Print(head->next);
        ret.push_back(head->val);
    }
    vector<int> reverseBookList(ListNode* head)
    {
        Print(head);
        return ret;
    }
};